Are Cook and Karp Ever the Same?

Genetic Algorithm-based Optimization Procedures to Find the Constants of Johnson-Cook Constitutive Equation

Johnson-Cook constitutive equation is one of the most famous constitutive equations that have ever been developed to model the hot deformation flow curves of different materials. This equation is a predefined model in the traditional finite element codes to describe the material behavior in applications such as simulating the manufacturing processes. In this work, two different genetic algorith...

Cook Reducibility is Faster than Karp Reduciblity in NP

Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract)

Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is show n that there is a language that is P T -complete (\Cook complete"), but not P m -complete (\Karp-Levin complete"), for NP. This conclusion, widely believed to be true, is not known to follow from P 6= NP or other traditional complexity-theoretic hypoth...

A Numerical Study on Aluminum Plate Response under Low Velocity Impact

In the present paper, a numerical study is performed to investigate the response of different plates aluminum alloys subjected to low velocity impact condition. In this regard, the square AA5083-H116 aluminum plates with dimensions 300×300 and 3 mm and 5 mm thick under low velocity impact are modelled, and a mesh convergence study is carried out to decide the appropriate number of elements. In ...

Combinatorics, Complexity, and Randomness, 1985

Richard M. Karp, of the University of California-Berkeley, received the 1985 ACM A. M. Taring Award for his fundamental contributions to complexity theory. Presented at the Association's Annual Conference in Denver, Colorado, in October, the award is ACM's highest honor in computer science research. By 1972, Karp had established a reputation as one of the world's leading computer science theori...